On Certain Combinatorial Diophantine Equations and Their Connection to Pythagorean Numbers
نویسندگان
چکیده
We call any (m+2)-tuple (n, r, r1, . . . , rm) satisfying this equation a binomial knapsack. The problem first came to the authors’ attention when considering a problem on symmetric functions, but the name is derived from the connection to knapsacktype problems. This article considers the simplest case of this problem. That is, we consider the problem of determining all 4-tuples (n, r, s, t) satisfying
منابع مشابه
Architecture, City and Mathematics: The Lost Connection
The connection between architecture and science and sound based on mathematical relations has continued to develop[ since the rise of the Western classical civilization that originated in Ancient Greece. The mysterious Pythagorean cosmology pursued as secret esoteric knowledge was related to the search of rhythm, proportionality and harmony. Even somewhat earlier, Greek mysteries were based on ...
متن کاملClass Numbers of Quadratic Fields Determined by Solvability of Diophantine Equations
In the literature there has been considerable attention given to the exploration of relationships between certain diophantine equations and class numbers of quadratic fields. In this paper we provide criteria for the insolvability of certain diophantine equations. This result is then used to determine when related real quadratic fields have class number bigger than 1. Moreover, based on criteri...
متن کاملOn Certain Diophantine Equations Related to Triangular and Tetrahedral Numbers
In this paper we give solutions of certain diophantine equations related to triangular and tetrahedral numbers and propose several problems connected with these numbers. The material of this paper was presented in part at the 11th International Workshop for Young Mathematicians NUMBER THEORY, Kraków, 14th20th september 2008.
متن کاملA Survey of Results on Primes in Short Intervals
Prime numbers have been a source of fascination for mathematicians since antiquity. The proof that there are infinitely many prime numbers is attributed to Euclid (fourth century B.C.). The basic method of determining all primes less than a given number N is the sieve of Eratosthenes (third century B.C.). Diophantus (third (?) century A.D.) was occupied with finding rational number solutions to...
متن کاملMacMahon’s Partition Analysis IV: Hypergeometric Multisums
In his famous book “Combinatory Analysis” MacMahon introduced Partition Analysis as a computational method for solving problems in connection with linear homogeneous diophantine inequalities and equations, respectively. The object of this paper is to introduce an entirely new application domain for MacMahon’s operator technique. Namely, we show that Partition Analysis can be also used for provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006